a__f(X, X) → a__f(a, b)
a__b → a
mark(f(X1, X2)) → a__f(mark(X1), X2)
mark(b) → a__b
mark(a) → a
a__f(X1, X2) → f(X1, X2)
a__b → b
↳ QTRS
↳ DependencyPairsProof
a__f(X, X) → a__f(a, b)
a__b → a
mark(f(X1, X2)) → a__f(mark(X1), X2)
mark(b) → a__b
mark(a) → a
a__f(X1, X2) → f(X1, X2)
a__b → b
MARK(b) → A__B
A__F(X, X) → A__F(a, b)
MARK(f(X1, X2)) → MARK(X1)
MARK(f(X1, X2)) → A__F(mark(X1), X2)
a__f(X, X) → a__f(a, b)
a__b → a
mark(f(X1, X2)) → a__f(mark(X1), X2)
mark(b) → a__b
mark(a) → a
a__f(X1, X2) → f(X1, X2)
a__b → b
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
MARK(b) → A__B
A__F(X, X) → A__F(a, b)
MARK(f(X1, X2)) → MARK(X1)
MARK(f(X1, X2)) → A__F(mark(X1), X2)
a__f(X, X) → a__f(a, b)
a__b → a
mark(f(X1, X2)) → a__f(mark(X1), X2)
mark(b) → a__b
mark(a) → a
a__f(X1, X2) → f(X1, X2)
a__b → b
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ QDPOrderProof
MARK(f(X1, X2)) → MARK(X1)
a__f(X, X) → a__f(a, b)
a__b → a
mark(f(X1, X2)) → a__f(mark(X1), X2)
mark(b) → a__b
mark(a) → a
a__f(X1, X2) → f(X1, X2)
a__b → b
The following pairs can be oriented strictly and are deleted.
The remaining pairs can at least be oriented weakly.
MARK(f(X1, X2)) → MARK(X1)
The value of delta used in the strict ordering is 1/2.
POL(MARK(x1)) = (2)x_1
POL(f(x1, x2)) = 1/4 + (7/2)x_1
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ QDPOrderProof
↳ QDP
↳ PisEmptyProof
a__f(X, X) → a__f(a, b)
a__b → a
mark(f(X1, X2)) → a__f(mark(X1), X2)
mark(b) → a__b
mark(a) → a
a__f(X1, X2) → f(X1, X2)
a__b → b